Specifying Logic Programs in Controlled Natural Language
نویسندگان
چکیده
Writing specifications for computer programs is not easy since one has to take into account the disparate conceptual worlds of the application domain and of software development. To bridge this conceptual gap we propose controlled natural language as a declarative and application-specific specification language. Controlled natural language is a subset of natural language that can be accurately and efficiently processed by a computer, but is expressive enough to allow natural usage by non-specialists. Specifications in controlled natural language are automatically translated into Prolog clauses, hence become formal and executable. The translation uses a definite clause grammar enhanced by feature structures. Inter-text references of the specification, e.g. anaphora, are resolved by discourse representation theory. The generated Prolog clauses are added to a knowledge base, and furthermore provide the input of a concept lexicon. We have implemented a prototypical specification system that successfully processes the greater part of the specification of a simple automated teller machine.
منابع مشابه
Specifying Concurrent Programs: a Case Study in JML and Separation Logic
This paper presents a case study for the verification of concurrent programs. A model for a central printer server was designed, implemented and annotated with a formal specification in JML, extended with syntax for permissionbased separation logic. The specification is compatible with the VerCors toolset which is currently being developed at the University of Twente. The goal of this research ...
متن کاملControlled Natural Language meets the SemanticWeb
In this paper we present PENG-D, a proposal for a controlled natural language that can be used for expressing knowledge about resources in the Semantic Web and for specifying ontologies in a human-readable way. After a brief overview of the main Semantic Web enabling technologies (and their deficiencies), we will show how statements and rules written in PENG-D are related to (a subset of) RDFS ...
متن کاملPlan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative functional programming in an elegant way that allows for recursive, remote function calls, and it provides a clear mechanism for the interaction between host and mobile code. Techniques for specifying and reasoning about su...
متن کاملFrom Separation Logic to Hyperedge Replacement and Back
Hyperedge replacement grammars and separation-logic formulas both define classes of graph-like structures. In this paper, we describe two effective translations between restricted hyperedge replacement grammars and formulas in a fragment of separation logic. These translations preserve the semantics of formulas and grammars. Hyperedge-replacement grammars [1] are a natural extension of context-...
متن کاملSBVR's Approach to Controlled Natural Language
The "Semantics of Business Vocabulary and Business Rules" (SBVR 1.0) is one of the initial specifications in the OMG's family of business-focused specifications. SBVR covers two aspects: Vocabulary (natural language ontology) and Rules (elements of guidance that govern actions). However, SBVR does not standardize any particular language for expressing vocabularies and rules. Instead, SBVR uses ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cmp-lg/9507009 شماره
صفحات -
تاریخ انتشار 1994